“Fair marriages”: An impossibility
نویسنده
چکیده
Article history: Received 6 October 2008 Received in revised form 27 May 2009 Accepted 10 June 2009 Available online 21 June 2009
منابع مشابه
Impossibility Results on Fair Exchange
The contribution of this paper is threefold. First, we propose a novel specification of the fair exchange problem that clearly separates safety and liveness. This specification assumes a synchronous model where processes communicate by message passing and might behave maliciously. In this model, we prove a first impossibility related to the notion of trust, stating that no solution to fair exch...
متن کاملOn the Impossibility of Fair Exchange without a Trusted Third Party
We attempt to formally deene the strong fair exchange problem and present a proof that it is impossible to solve strong fair exchange without a trusted third party. The proof is established by relating strong fair exchange to the problem of consensus and adapting the impossibility result of Fischer, Lynch and Paterson. We show that strong fair exchange is at least as hard as consensus and explo...
متن کاملFair Computation with Rational Players
We consider the problem of fair multiparty computation, where fairness means (informally) that all parties should learn the correct output. A seminal result of Cleve (STOC 1986) shows that fairness is, in general, impossible to achieve if a majority of the parties is malicious. Here, we treat all parties as rational and seek to understand what can be done. Asharov et al. (Eurocrypt 2011) showed...
متن کاملA Fair Infinite Lottery
An infinity of gods collectively select a random natural number by each removing a finite number of balls from an urn in a reverse supertask. It is discussed whether this is an absurdity that indicates the impossibility of reverse supertasks.
متن کاملA Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
It is well known that it is impossible for two parties to toss a coin fairly (Cleve, STOC 1986). This result implies that it is impossible to securely compute with fairness any function that can be used to toss a fair coin. In this paper, we focus on the class of deterministic Boolean functions with finite domain, and we ask for which functions in this class is it possible to information-theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008